Maximum Skew-symmetric Flows and Their Applications to B-matchings
نویسندگان
چکیده
We introduce the maximum integer skew-symmetric ow problem (MSFP) which generalizes both the maximum ow and maximum matching problems. We establish analogs of the classical ow decomposition, augmenting path, and max-ow min-cut theorems for skew-symmetric ows. These theoretical results are then used to develop an O(M(n; m) + nm) time algorithm for solving the MSFP, where M(n; m) is the time needed to nd a maximum integer (usual) ow in a network with n nodes and m arcs. This gives a method of the same complexity for the capacitated b-matching problem. Other methods for solving the MSFP are also discussed.
منابع مشابه
Maximum skew-symmetric flows and matchings
The maximum integer skew-symmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of self-conjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical results on usual network flows, such as the flow decomposition, augmenting path, and max-flow min-c...
متن کاملSkew-slash distribution and its application in topics regression
In many issues of statistical modeling, the common assumption is that observations are normally distributed. In many real data applications, however, the true distribution is deviated from the normal. Thus, the main concern of most recent studies on analyzing data is to construct and the use of alternative distributions. In this regard, new classes of distributions such as slash and skew-sla...
متن کاملMaximum Skew-Symmetric Flows
We introduce the maximumskew-symmetric ow problem which generalizes ow and matching problems. We develop a theory of skew-symmetric ows that is parallel to the classical ow theory. We use the newly developed theory to extend, in a natural way, the blocking ow method of Dinitz to the skew-symmetric ow case. In the special case of the skew-symmetric ow problem that corresponds to cardinality matc...
متن کاملThe (R,S)-symmetric and (R,S)-skew symmetric solutions of the pair of matrix equations A1XB1 = C1 and A2XB2 = C2
Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...
متن کاملOn the use of suboptimal matchings for scaling and ordering sparse symmetric matrices
The use of matchings is a powerful technique for scaling and ordering sparse matrices prior to the solution of a linear system Ax D b. Traditional methods such as implemented by the HSL software package MC64 use the Hungarian algorithm to solve the maximum weight maximum cardinality matching problem. However, with advances in the algorithms and hardware used by direct methods for the paralleliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999